A Third-Order Representation of the λμ-Calculus
نویسنده
چکیده
Higher-order logical frameworks provide a powerful technology to reason about object languages with binders. This will be demonstrated for the case of the λμ-calculus with two different binders which can most elegantly be represented using a third-order constant. Since cases of thirdand higher-order encodings are very rare in comparison with those of second order, a second-order representation is given as well and equivalence to the third-order representation is proven formally.
منابع مشابه
Separation with streams in the Λμ-calculus
The λμ-calculus is an extension of the λ-calculus introduced in 1992 by Parigot [17] in order to generalize the Curry-Howard isomorphism to classical logic. Two versions of the calculus are usually considered in the literature: Parigot’s original syntax and an alternative syntax introduced by de Groote. In 2001, David and Py [5] proved that the Separation Property (also referred to as Böhm theo...
متن کاملStrong normalization of the second-order symmetric lambda mu -calculus
Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the second-order λμ-calculus with such rules.
متن کاملTyping streams in the Λμ-calculus: extended abstract
Λμ-calculus [11] has been built as an untyped extension of the λμ-calculus [10] in order to recover Böhm theorem which was known to fail in λμ-calculus since a result by David & Py [2]. An essential computational feature of Λμ-calculus for separation to hold is the unrestricted use of abstractions over continuation variables that provides the calculus with a construction of streams. In [11], Λμ...
متن کاملStrong Normalization of Second Order Symmetric lambda-Calculus
Parigot suggested symmetric structural reduction rules for application to μ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order λμ-calculus with these rules.
متن کاملNon deterministic classical logic: the λμ-calculus
In this paper, we present an extension of λμ-calculus called λμcalculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or.
متن کامل